Graph degeneracy and orthogonal vector representations
نویسندگان
چکیده
We apply a technique of Sinkovic and van der Holst for constructing orthogonal vector representations graph whose complement has given treewidth to graphs degeneracy.
منابع مشابه
Orthogonal representations, minimum rank, and graph complements
Orthogonal representations are used to show that complements of certain sparse graphs have (positive semidefinite) minimum rank at most 4. This bound applies to the complement of a 2-tree and to the complement of a unicyclic graph. Hence for such graphs, the sum of the minimum rank of the graph and the minimum rank of its complement is at most two more than the order of the graph. The minimum r...
متن کاملBuilding Graph Representations of Deep Vector Embeddings
Patterns stored within pre-trained deep neural networks compose large and powerful descriptive languages that can be used for many different purposes. Typically, deep network representations are implemented within vector embedding spaces, which enables the use of traditional machine learning algorithms on top of them. In this short paper we propose the construction of a graph embedding space in...
متن کاملǫ-Constants and Orthogonal Representations
In this paper we suppose G is a finite group acting tamely on a regular projective curve X over Z and V is an orthogonal representation of G of dimension 0 and trivial determinant. Our main result determines the sign of the ǫ-constant ǫ(X/G, V ) in terms of data associated to the archimedean place and to the crossing points of irreducible components of finite fibers of X , subject to certain st...
متن کاملEpsilon constants and orthogonal representations
In this paper we suppose G is a finite group acting tamely on a regular projective curve X over Z and V is an orthogonal representation of G of dimension 0 and trivial determinant. Our main result determines the sign of the -constant (X/G, V ) in terms of data associated to the archimedean place and to the crossing points of irreducible components of finite fibers of X , subject to certain stan...
متن کاملA Note on Support Vector Machine Degeneracy
When training Support Vector Machines (SVMs) over non-separable data sets, one sets the threshold b using any dual cost coeecient that is strictly between the bounds of 0 and C. We show that there exist SVM training problems with dual optimal solutions with all coeecients at bounds, but that all such problems are degenerate in the sense that the \optimal separating hyperplane" is given by w = 0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Linear Algebra
سال: 2023
ISSN: ['1081-3810', '1537-9582']
DOI: https://doi.org/10.13001/ela.2023.6907